Matrix inversion and digraphs: the one factor case
نویسندگان
چکیده
The novel concept of a cyclic sequence of a digraph that has precisely one factor is defined, and is used to characterize the entries of the inverse of a matrix with such a digraph. This leads to a characterization of a strongly sign-nonsingular matrix in terms of cyclic sequences. Nonsingular nearly reducible matrices are a well-known class of matrices having precisely one nonzero diagonal, and a simple expression for the entries of the inverse of such a matrix in terms of cyclic sequences is derived. A consequence is that a nonsingular nearly reducible matrix is strongly signnonsingular. Several conditions that are equivalent to the inverse of a nonsingular nearly reducible matrix being nearly reducible are obtained.
منابع مشابه
THE RELATION BETWEEN TOPOLOGICAL ORDERING AND ADJACENCY MATRIX IN DIGRAPHS
In this paper the properties of node-node adjacency matrix in acyclic digraphs are considered. It is shown that topological ordering and node-node adjacency matrix are closely related. In fact, first the one to one correspondence between upper triangularity of node-node adjacency matrix and existence of directed cycles in digraphs is proved and then with this correspondence other properties of ...
متن کاملOn spectral radius of strongly connected digraphs
It is known that the directed cycle of order $n$ uniquely achieves the minimum spectral radius among all strongly connected digraphs of order $nge 3$. In this paper, among others, we determine the digraphs which achieve the second, the third and the fourth minimum spectral radii respectively among strongly connected digraphs of order $nge 4$.
متن کاملMore skew-equienergetic digraphs
Two digraphs of same order are said to be skew-equienergetic if their skew energies are equal. One of the open problems proposed by Li and Lian was to construct non-cospectral skew-equienergetic digraphs on n vertices. Recently this problem was solved by Ramane et al. In this paper, we give some new methods to construct new skew-equienergetic digraphs.
متن کاملA Direct Matrix Inversion-Less Analysis for Distribution System Power Flow Considering Distributed Generation
This paper presents a new direct matrix inversion-less analysis for radial distribution systems (RDSs). The method can successfully deal with weakly meshed distribution systems. (WMDSs). Being easy to implement, direct methods (DMs) provide an excellent performance. Matrix inversion is the mean reason of divergence and low-efficiency in power flow algorithms. In this paper, the performance of t...
متن کاملA stable iteration to the matrix inversion
The matrix inversion plays a signifcant role in engineering and sciences. Any nonsingular square matrix has a unique inverse which can readily be evaluated via numerical techniques such as direct methods, decomposition scheme, iterative methods, etc. In this research article, first of all an algorithm which has fourth order rate of convergency with conditional stability will be proposed. ...
متن کامل